Personalized service selection using Conditional Preference Networks
نویسندگان
چکیده
منابع مشابه
Possibilistic Conditional Preference Networks
The paper discusses the use of product-based possibilistic networks for representing conditional preference statements on discrete variables. The approach uses non-instantiated possibility weights to define conditional preference tables. Moreover, additional information about the relative strengths of symbolic weights can be taken into account. It yields a partial preference order among possibl...
متن کاملProbabilistic Conditional Preference Networks
This paper proposes a “probabilistic” extension of conditional preference networks as a way to compactly represent a probability distributions over preference orderings. It studies the probabilistic counterparts of the main reasoning tasks, namely dominance testing and optimisation from the algorithmical and complexity viewpoints. Efficient algorithms for tree-structured probabilistic CP-nets a...
متن کاملLearning conditional preference networks
Conditional preference networks (CP-nets) have recently emerged as a popular language capable of representing ordinal preference relations in a compact and structured manner. In this paper, we investigate the problem of learning CP-nets in the well-known model of exact identification with equivalence and membership queries. The goal is to identify a target preference ordering with a binary-valu...
متن کاملPersonalized Web Service Selection
Web services have shown the potential to have a significant impact on the business, however, also shown problems like automatic service discovery or service interoperability issue. Because of today’s wide variety of services offered to perform a specific task, it is essential that users are guided in the eventual selection of appropriate services. In this paper we present an extensive study of ...
متن کاملLearning Conditional Preference Networks with Queries
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering with a binary-valued CP-net by guiding the user through a sequence of queries. Each example is a dominance test on some pair of outcomes. In this setting, we show that acyclic CP-nets are not learnable with equivalence q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge-Based Systems
سال: 2019
ISSN: 0950-7051
DOI: 10.1016/j.knosys.2018.10.040